Clique problem hard to approximate : PCP approach

When are two views inconsistent? First consider the case when the random strings used in these views are different, i.e. we have (R, b1, b2, ..., bq) and (R′, b1, b ′ 2, ..., b ′ q). These views are inconsistent, if for some i, j the bits bi and bj refer to the same location of the proof π, but bi 6= bj . Next consider the case when the random strings used in these views are the same, i.e. we have (R, b1, b2, ..., bq) and (R, b1, b ′ 2, ..., b ′ q). These views are inconsistent, if for some i bi 6= bi. So, we can say that two views are consistent if they query disjoint locations or agree on intersecting locations.